Duality for semi-definite and semi-infinite programming
نویسندگان
چکیده
منابع مشابه
Necessary Optimality and Duality for Multiobjective Semi-infinite Programming
The aim of this paper is to deal with a class of multiobjective semi-infinite programming problem. For such problem, several necessary optimality conditions are established and proved using the powerful tool of K − subdifferential and the generalized convexity namely generalized uniform ( , , , ) K F d α ρ − − convexity. We also formulate the Wolf type dual models for the semi-infinite programm...
متن کاملOptimality and Duality for Minimax Fractional Semi-Infinite Programming
The purpose of this paper is to consider a class of nonsmooth minimax fractional semi-infinite programming problem. Based on the concept of H − tangent derivative, a new generalization of convexity, namely generalized uniform ( , ) H B ρ − invexity, is defined for this problem. For such semi-infinite programming problem, several sufficient optimality conditions are established and proved by uti...
متن کاملDuality for Nondifferentiable Multiobjective Semi-infinite Programming with Generalized Convexity
The purpose of this paper is to consider the Mond-Weir type dual model for a class of non-smooth multiobjective semi-infinite programming problem. In this work, we use generalization of convexity namely ( , ) G F θ − convexity and Kuhn-Tucker constraint qualification, to prove new duality results for such semi-infinite programming problem. Weak, strong and converse duality theorems are derived....
متن کاملRobust envelope-constrained filter with orthonormal bases and semi-definite and semi-infinite programming
In this paper, the equivalence relation between a semi-infinite quadratically constrained convex quadratic programming problem and a combined semidefinite and semi-infinite programming problem is considered. Then, an efficient and reliable discretization algorithm for solving a general class of combined semidefinite and semi-infinite programming problems is developed. Both the continuoustime en...
متن کاملINVITED REVIEW Semi-infinite programming, duality, discretization and optimality conditionsy
Here is a (possibly infinite) index set, R 1⁄4 R [ fþ1g [ f 1g denotes the extended real line, f : R ! R and g : R !R. The above optimization problem is performed in the finite-dimensional space R and, if the index set is infinite, is a subject to an infinite number of constraints, therefore it is referred to as a SIP problem. There are numerous applications which lead to SIP problems. We can r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization
سال: 2003
ISSN: 0233-1934,1029-4945
DOI: 10.1080/02331930310001611484